On k-path pancyclic graphs
نویسندگان
چکیده
منابع مشابه
On k-path pancyclic graphs
For integers k and n with 2 ≤ k ≤ n− 1, a graph G of order n is k-path pancyclic if every path P of order k in G lies on a cycle of every length from k + 1 to n. Thus a 2-path pancyclic graph is edge-pancyclic. In this paper, we present sufficient conditions for graphs to be k-path pancyclic. For a graph G of order n ≥ 3, we establish sharp lower bounds in terms of n and k for (a) the minimum d...
متن کاملGeneralizing Pancyclic and k-Ordered Graphs
Given positive integers k m n, a graphG of order n is ðk;mÞ-pancyclic if for any set of k vertices of G and any integer r with m r n, there is a cycle of length r containing the k vertices. Minimum degree conditions and minimum sum of degree conditions of nonadjacent vertices that imply a graph is ðk;mÞ-pancylic are proved. If the additional property that the k vertices must appear on the cycle...
متن کاملStrongly pancyclic and dual-pancyclic graphs
Say that a cycle C almost contains a cycle C− if every edge except one of C− is an edge of C. Call a graph G strongly pancyclic if every nontriangular cycle C almost contains another cycle C− and every nonspanning cycle C is almost contained in another cycle C. This is equivalent to requiring, in addition, that the sizes of C− and C differ by one from the size of C. Strongly pancyclic graphs ar...
متن کاملLocally Pancyclic Graphs
We prove the following theorem. Let G be a graph of order n and let W V(G). If |W | 3 and dG(x)+dG( y) n for every pair of non-adjacent vertices x, y # W, then either G contains cycles C , C, ..., C |W | such that C i contains exactly i vertices from W (i=3, 4, ..., |W | ), or |W |=n and G=Kn 2, n 2 , or else |W |=4, G[W]=K2, 2 . This generalizes a result of J. A. Bondy (1971, J. Combin. Theory...
متن کاملMinimal Degree and (k, m)-Pancyclic Ordered Graphs
Given positive integers k £ m £ n, a graph G of order n is (k, m)-pancyclic ordered if for any set of k vertices of G and any integer r with m £ r £ n, there is a cycle of length r encountering the k vertices in a specified order. Minimum degree conditions that imply a graph of sufficiently large order n is (k, m)-pancylic ordered are proved. Examples showing that these constraints are best pos...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2015
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.1795